Intelligent Testing can be Very Lazy
نویسنده
چکیده
Testing is a search process and a test suite is complete when the search has examined all the comers of the program. Standard models of test suite sizes are gross over-estimates ince they are unaware of the nature of that search space. For example, only a small part of the possible search space is ever exercised in practice. Further, a repeated result is that a few random searches often yields as much information as more thorough search strategies. Hence, only a few tests are needed to sample the range of behaviours of a program.
منابع مشابه
Lazy Occlusion Grid Culling
We present Lazy Occlusion Grid Culling, a new image-based occlusion culling technique for rendering of very large scenes which can be of general type. It is based on a low-resolution grid that is updated in a lazy manner and that allows fast decisions if an object is occluded or visible together with a hierarchical scene-representation to cull large parts of the scene at once. It is hardware-ac...
متن کاملIntelligent Human Activity Recognition Scheme for Ehealth Applications
Automatic activity recognition systems aim to capture the state of the user and its environment by exploiting heterogeneous sensors, and permit continuous monitoring of numerous physiological signals, where these sensors are attached to the subject's body. This can be immensely useful in healthcare applications, for automatic and intelligent daily activity monitoring for elderly people. In this...
متن کاملOptimal Bandwidth Design for Lazy Learning Via Particle Swarm Optimization
Lazy learning is a memory-based learning techniques, which performs local regression around a point of interest. Because of simplicity and ease in application, it has been successfully used in a large number of complex systems. However, a crucial step in this algorithm is how to design the bandwidth h, which controls the precision of the prediction. Unlike conventional trial and error tricks, t...
متن کاملHardware-Assisted and Target-Directed Evaluation of Functional Programs
A new reduction machine for lazy functional languages called the Reduceron is proposed. The Reduceron exploits wide, parallel memories to increase evaluation speed, and is prototyped in programmable hardware. It is compared with conventional machines by a theoretical analysis and by an experimental comparison. It is shown that the use of wide, parallel memories in a graph reduction machine can ...
متن کاملIntelligent Query Answering by Knowledge Discovery Techniques
Knowledge discovery in databases facilitates querying database knowledge, cooperative query answering and semantic query optimization in database systems. In this paper, we investigate the application of discovered knowledge, concept hierarchies, and knowledge discovery tools for intelligent query answering in database systems. A knowledge-rich data model is constructed to incorporate discovere...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999